Belief Function Propagation in Directed Evidential Networks
نویسندگان
چکیده
In this paper, we propose a computational data structure based on the binary join tree where the independence relations of the original directed evidential networks (DEVN) are maintained. The proposed solution uses disjunctive rule of combination (DRC) and generalized Bayesian theorem (GBT), which make possible the use of the conditional belief functions directly for reasoning in the DEVN.
منابع مشابه
Evidential Reasoning with Conditional Belief Functions
In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such n...
متن کاملA Comparison of Architectures for Exact Inference in Evidential Networks
This paper presents a comparison of two architectures for belief propagation in evidential networks, namely the binary join tree using joint belief functions [9] and the modified binary join tree using conditional belief functions [2]. This comparison is done from the perspective of graphical structure, messagepassing scheme, computational efficiency, storage efficiency, and complexity analysis...
متن کاملUrban Inundation Hazard Potential using Evidential Belief Function model (EBF) (Case study: Emam Ali town, Mashhad city)
Inundation in urban areas due to dens storm has created many problems for all cities thorough the world. Urban flood hazard zoning may provide useful information for dealing with contingency and alleviating risk and loss of life and property. Therefore, to management of urban area, flood relief measures and prioritized to address flooding problems should be identified areas that are more aff...
متن کاملImportance sampling algorithms for Bayesian networks: Principles and performance
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in the face of extremely unlikely evidence. In addressing this problem, importance sampling algorithms seem to be most successful. We discuss the principles underlying the importance sampling algorithms in Bayesian networks. After that, we describe Evidence Pre-propagation Importance Sampling (EPIS...
متن کاملThe belief-function approach to aggregating audit evidence
In this article, we present the belief-function approach to aggregating audit evidence. The approach uses an evidential network to represent the structure of audit evidence. In turn, it allows us to treat all types of dependencies and relationships among accounts and items of evidence, and thus the approach should help the auditor conduct an efficient and effective audit. Aggregation of evidenc...
متن کامل